Baire Paradoxical Decompositions Need at Least Six Pieces
نویسندگان
چکیده
منابع مشابه
Baire Measurable Paradoxical Decompositions via Matchings
We show that every locally finite bipartite Borel graph satisfying a strengthening of Hall’s condition has a Borel perfect matching on some comeager invariant Borel set. We apply this to show that if a group acting by Borel automorphisms on a Polish space has a paradoxical decomposition, then it admits a paradoxical decomposition using pieces having the Baire property. This strengthens a theore...
متن کاملBanach-Tarski paradox using pieces with the property of Baire.
In 1924 Banach and Tarski, using ideas of Hausdorff, proved that there is a partition of the unit sphere S2 into sets A1,...,Ak,B1,..., Bl and a collection of isometries [sigma1,..., sigmak, rho1,..., rhol] so that [sigma1A1,..., sigmakAk] and [rho1B1,..., rholBl] both are partitions of S2. The sets in these partitions are constructed by using the axiom of choice and cannot all be Lebesgue meas...
متن کاملBanach-tarski Decompositions Using Sets with the Property of Baire
Perhaps the most strikingly counterintuitive theorem in mathematics is the "Banach-Tarski paradox": A ball in R3 can be decomposed into finitely many pieces which can be rearranged by rigid motions and reassembled to form two balls of the same size as the original. The Axiom of Choice is used to construct the decomposition; the "paradox" is resolved by noting that the pieces cannot be Lebesgue ...
متن کاملThe distinguishing chromatic number of bipartite graphs of girth at least six
The distinguishing number $D(G)$ of a graph $G$ is the least integer $d$ such that $G$ has a vertex labeling with $d$ labels that is preserved only by a trivial automorphism. The distinguishing chromatic number $chi_{D}(G)$ of $G$ is defined similarly, where, in addition, $f$ is assumed to be a proper labeling. We prove that if $G$ is a bipartite graph of girth at least six with the maximum ...
متن کاملTensor Decompositions, Alternating Least Squares and other Tales
This work was originally motivated by a classification of tensors proposed by Richard Harshman. In particular, we focus on simple and multiple “bottlenecks”, and on “swamps”. Existing theoretical results are surveyed, some numerical algorithms are described in details, and their numerical complexity is calculated. In particular, the interest in using the ELS enhancement in these algorithms is d...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the American Mathematical Society
سال: 1994
ISSN: 0002-9939
DOI: 10.2307/2160449